A Novel Multi Exponentiation Method
نویسنده
چکیده
The efficiency and security of most elliptic curve cryptosystems are based on multi exponentiation, such as the verification process in elliptic curve digital signature algorithm. Simultaneous methods are considered to be the most efficient for multi exponentiation. In this paper, we propose a method to construct an addition chain for simultaneous multi exponentiation, which has never been considered in the literature before. We discuss the strategy for the two dimension case, b1 b2 f and assume that such strategy could be generalize for arbitrary cases.
منابع مشابه
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei i in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where in...
متن کاملAST Pre-Processing For The Sliding Window Method Using Genetic Algorithms
Modular exponentiation is a cornerstone operation to several public-key cryptography systems such as the RSA. It is performed using successive modular multiplications. The latter is time consuming for large operands. Accelerating public-key cryptography software or hardware needs reducing the total number of modular multiplication needed. This paper introduces a novel idea based on genetic algo...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملFast and Constant-Time Implementation of Modular Exponentiation
Modular exponentiation is an important operation which requires a vast amount of computations. Therefore, it is crucial to build fast exponentiation schemes. Since Cache and data-dependent branching behavior can alter the runtime of an algorithm significantly, it is also important to build an exponentiation scheme with constant run-time. However, such approaches have traditionally added signifi...
متن کاملHigh-speed Algorithms for Public-key Cryptosystems in an e-Commerce Environment
Modular exponentiation is one of the most important operations in public-key cryptosystems. A modular exponentiation is composed of repetition of modular multiplications. Again, the modular multiplication consists of a multi-precision multiplication and a modular reduction. Therefore, we can reduce the execution time of the modular exponentiation by two methods. One is to reduce the number of m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008